Solving the Steamroller, and Other Puzzles, with Extended Disjunctive Logic Programming
نویسنده
چکیده
We show how to solve the classical ATP benchmark test problem Schu-bert's Steamroller, and other puzzles, in the nonclassical framework of extended disjunctive logic programming (EDLP) where neither Contrapo-sition nor Reasoning by Cases are valid principles of inference. While thèSteamroller' can be solved using only Detachment and Disjunctive Syl-logism, another puzzle, `Who killed aunt Agatha ?', needs in addition a local form of Contraposition, resp. Reasoning by Cases, which is achieved by declaring certain predicates as exact in the sense of KK or66]. Besides being able to solve certain classical ATP problems in a monotonic reasoning mode, EDLP can as well treat commonsense reasoning problems by employing its intrinsic nonmonotonic inference capabilities. This is illustrated by means of a nonmonotonic variant of thèSteamroller' problem. EDLP thus proves itself as a powerful general-purpose AI reasoning system.
منابع مشابه
Solving Practical Reasoning Poblems with Extended Disjunctive Logic Programming
We present a de nition of stable generated models for extended generalized logic programs (EGLP) which a) subsumes the de nition of the answer set semantics for extended normal logic programs [GL91]; and b) does not refer to negation-as-failure by allowing for arbitrary quanti er free formulas in the body and in the head of as rule (i.e. does not depend on the presence of any speci c connective...
متن کاملTowards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
Answer set programming (ASP) with disjunction offers a powerful tool for declaratively representing and solving hard problems. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise and intuitive way, where the encoding reflects the typical “guess and check” nature of NP problems: The property is encoded in a way such that polynomial size certif...
متن کاملFormalizing argumentative reasoning in a possibilistic 3 logic programming setting with fuzzy unification q
12 Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from 13 argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-lan14 guage level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot 15 be expressed in the object la...
متن کاملTowards Automated Integration of Guess and Check Programs in Answer Set Programming
Reasoning (LPNMR-7), I. Niemelä and V. Lifschitz, editors, LNCS, c 2004 Springer. Towards Automated Integration of Guess and Check Programs in Answer Set Programming ? Thomas Eiter1 and Axel Polleres2 1 Institut für Informationssysteme, TU Wien, A-1040 Wien, Austria [email protected] 2 Institut für Informatik, Universität Innsbruck, A-6020 Innsbruck, Austria [email protected] Abstrac...
متن کاملTransforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature of NP problems: The property is encoded in a way such that polynomial size certificates for it correspond to stable models of a program. However, the problemsolving capacity of full disjunctive logic programs (DLPs) is bey...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994